Polynomial Schauder basis of optimal degree with Jacobi orthogonality

نویسندگان

  • Jürgen Prestin
  • Jörn Schnieder
چکیده

In our paper we construct a polynomial Schauder basis (pα,β,n)n∈N0 of optimal degree with Jacobi orthogonality. A candidate for such a basis is given by the use of some wavelet theoretical methods, which were already successful in case of Tchebysheff and Legendre orthogonality. To prove that this sequence is in fact a Schauder basis for C[−1, 1] and as the main difficulty of the whole proof we show the uniform boundedness of its Lebesgue constants sup x∈[−1,1],n∈N0 ∥∥∥ n ∑ j=0 pα,β,j(x)pα,β,j ∥∥∥ L1ωα,β [−1,1] <∞.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Orthogonality of Jacobi Polynomials with General Parameters

Abstract. In this paper we study the orthogonality conditions satisfied by Jacobi polynomials P (α,β) n when the parameters α and β are not necessarily > −1. We establish orthogonality on a generic closed contour on a Riemann surface. Depending on the parameters, this leads to either full orthogonality conditions on a single contour in the plane, or to multiple orthogonality conditions on a num...

متن کامل

A Polynomial time Jacobi Method for Lattice Basis Reduction

Among all lattice reduction algorithms, the LLL algorithm is the first and perhaps the most famous polynomial time algorithm, and it is widely used in many applications. In 2012, S. Qiao [24] introduced another algorithm, the Jacobi method, for lattice basis reduction. S. Qiao and Z. Tian [25] improved the Jacobi method further to be polynomial time but only produces a Quasi-Reduced basis. In t...

متن کامل

Electronic Transactions on Numerical Analysis Volume 19, 2005 Contents

In this paper we study the orthogonality conditions satisfied by Jacobi polynomials P (α,β) n when the parameters α and β are not necessarily > −1. We establish orthogonality on a generic closed contour on a Riemann surface. Depending on the parameters, this leads to either full orthogonality conditions on a single contour in the plane, or to multiple orthogonality conditions on a number of con...

متن کامل

Orthogonality and asymptotics of Pseudo-Jacobi polynomials for non-classical parameters

The family of general Jacobi polynomials P (α,β) n where α, β ∈ C can be characterised by complex (nonhermitian) orthogonality relations (cf. [15]). The special subclass of Jacobi polynomials P (α,β) n where α, β ∈ R are classical and the real orthogonality, quasi-orthogonality as well as related properties, such as the behaviour of the n real zeros, have been well studied. There is another spe...

متن کامل

Optimal Constrained Explicit Multi-degree Reduction Approximation of DP Curves ★

DP curves, which possess the shape-preserving property and linear complexity evaluation algorithm, occupy a significantly important place in computer aided geometric design. Thus to do the research on the DP curves algorithms has a positive meaning. Aphirukmatakun et al. presented a degree elevation algorithm of DP curves based on the transformation between the DP basis and power basis. At the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Approximation Theory

دوره 174  شماره 

صفحات  -

تاریخ انتشار 2013